/*
自己选择的路 ,跪着也要走完。朋友们 , 虽然这个世界日益浮躁起来,只
要能够为了当时纯粹的梦想和感动坚持努力下去 , 不管其它人怎么样,我
们也能够保持自己的本色走下去。
To the world , you will be a person , but to a person , you
will be the world .                               ——AKPower
*/
//作者:AKPower
//算法:
#include <iostream>
#include <cmath>
#include <algorithm>
#include <cstring>
#include <vector>
#include <map>
#include <queue>
#include <cstdio>
#include <string>
#include <stack>
#include <set>
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
string ans;
string num;
string s;

char f(char c, ll n)
{
    if (c >= 'a' && c <= 'z')
    {
        if (('z' - c) >= n)
        {
            return (c + n);
        }
        else
        {
            n -= ('z' - c);
            c = 'B';
            return (c + n - 1);
        }
    }
    if (c >= 'A' && c <= 'Z')
    {
        if (('Z' - c) >= n)
        {
            return (c + n);
        }
        else
        {
            n -= ('Z' - c);
            c = 'b';
            return (c + n - 1);
        }
    }
}

int main()
{
    IOS;
    cin >> s;
    for (ll i = 0; i < 32; i++)
    {
        if (s[i] >= '0' && s[i] <= '9')
        {
            num.push_back(s[i]);
        }
        else
            ans.push_back(s[i]);
    }
    for (ll i = 0; i < 16; i++)
    {
        ans[i] = f(ans[i], num[i] - '0');
    }
    for (ll i = 0; i < 4; i++)
    {
        reverse(ans.begin() + i * 4, ans.begin() + i * 4 + 4);
    }
    cout << ans << endl;
    getchar();
    getchar();
    return 0;
}
